全文获取类型
收费全文 | 6525篇 |
免费 | 1009篇 |
国内免费 | 695篇 |
专业分类
化学 | 2274篇 |
晶体学 | 69篇 |
力学 | 859篇 |
综合类 | 169篇 |
数学 | 2209篇 |
物理学 | 2649篇 |
出版年
2023年 | 48篇 |
2022年 | 78篇 |
2021年 | 146篇 |
2020年 | 156篇 |
2019年 | 148篇 |
2018年 | 167篇 |
2017年 | 235篇 |
2016年 | 264篇 |
2015年 | 234篇 |
2014年 | 353篇 |
2013年 | 505篇 |
2012年 | 341篇 |
2011年 | 412篇 |
2010年 | 309篇 |
2009年 | 381篇 |
2008年 | 372篇 |
2007年 | 440篇 |
2006年 | 403篇 |
2005年 | 378篇 |
2004年 | 359篇 |
2003年 | 309篇 |
2002年 | 300篇 |
2001年 | 231篇 |
2000年 | 224篇 |
1999年 | 220篇 |
1998年 | 194篇 |
1997年 | 172篇 |
1996年 | 115篇 |
1995年 | 113篇 |
1994年 | 99篇 |
1993年 | 71篇 |
1992年 | 61篇 |
1991年 | 68篇 |
1990年 | 53篇 |
1989年 | 30篇 |
1988年 | 38篇 |
1987年 | 31篇 |
1986年 | 33篇 |
1985年 | 23篇 |
1984年 | 19篇 |
1983年 | 4篇 |
1982年 | 13篇 |
1981年 | 9篇 |
1980年 | 7篇 |
1979年 | 14篇 |
1978年 | 10篇 |
1977年 | 12篇 |
1976年 | 5篇 |
1975年 | 4篇 |
1972年 | 4篇 |
排序方式: 共有8229条查询结果,搜索用时 31 毫秒
81.
定常的热传导-对流问题的Galerkin/Petrov最小二乘混合元方法 总被引:1,自引:0,他引:1
1.引言 热传导-对流问题是大气动力学中的一个重要的方程,这个方程组也称为强迫耗散的非线性系统方程组,其较Navier-Stokes方程多了一个未知函数温度场,且温度与速度和压力之间存在着复杂的非线性关系.从热动力学可知,任何运动都会产生热量即有温度,而且温度与速度和压力之间必定互相转化,因此对该非线性系统的研究更具有实际意义.[1]先对 相似文献
82.
振动系统的模态分析实验设计 总被引:8,自引:0,他引:8
利用模态分析原理和简单试验仪器,得到了直观的悬臂梁和圆盘前4阶模态振型,使学生熟悉了模态分析原理和测试方法,有利于学生对振动规律的理解. 相似文献
83.
V. F. Radantsev V. V. Kruzhaev G. I. Kulaev 《Physica E: Low-dimensional Systems and Nanostructures》2004,20(3-4):396
The Rashba effect in metal–insulator–semiconductor (MIS) structures based on zero-gap HgCdTe is investigated experimentally and theoretically over a wide doping range NA–ND=3×1015–3×1018 cm−3. Increase of doping enlarges the magnitude of the effect at the same 2D concentration and strengthens a gate-voltage dependence of the Rashba splitting. The results demonstrate values of Rashba polarization as high as PR0.5 and a capability to control the Rashba effect strength at constant electron concentration. 相似文献
84.
Brenda J. Latka 《Journal of Graph Theory》2003,42(3):165-192
A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N5 on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N5 by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T1,…,Tk} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T1,…,Tk is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003 相似文献
85.
A. F. G. Monte M. A. G. Soler S. W. da Silva B. B. D. Rodrigues P. C. Morais A. A. Quivy J. R. Leite 《Physica E: Low-dimensional Systems and Nanostructures》2004,23(3-4):466
We have investigated the influence of vicinal GaAs substrates on the optical and electronic properties of InGaAs/GaAs quantum wells (QWs). A single In0.10Ga0.90As QW was grown by molecular-beam epitaxy on a vicinal GaAs(0 0 1) substrate with a miscut angle of 0° (nominal), 2°, 4° and 6° towards [1 1 0]. The carrier diffusion was obtained by a micro-photoluminescence scan technique that permits to observe the effective diffusion length characterized by the lateral spread of carriers in the QW followed by radiative recombination. The carrier diffusion length was obtained parallel (L||) and perpendicular (L) to the atomic steps. The diffusion length decreases as the temperature increases up to 100 K. Above this temperature we found different behaviours that depend on the sample miscut angle. 相似文献
86.
87.
88.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
89.
研究了Banach空间中拟-似变分包含解的存在与逼近问题.给出了一种寻求解的新的迭代算法,建立了具混合误差的Ishikawa型迭代序列强收敛到解的充要条件.所得结果推广了一些相关的结果. 相似文献
90.